Clique problem hard to approximate : PCP approach
نویسنده
چکیده
When are two views inconsistent? First consider the case when the random strings used in these views are different, i.e. we have (R, b1, b2, ..., bq) and (R′, b1, b ′ 2, ..., b ′ q). These views are inconsistent, if for some i, j the bits bi and bj refer to the same location of the proof π, but bi 6= bj . Next consider the case when the random strings used in these views are the same, i.e. we have (R, b1, b2, ..., bq) and (R, b1, b ′ 2, ..., b ′ q). These views are inconsistent, if for some i bi 6= bi. So, we can say that two views are consistent if they query disjoint locations or agree on intersecting locations.
منابع مشابه
Lecture 9: Dinur’s Proof of the PCP Theorem
The theory of NP-completeness, as developed by Cook, Levin, and Karp, states that any language, L in NP is reducible to the Boolean satisfiability problem, 3SAT. By this, we mean that for every instance, x of the language L, we can obtain a satisfiability instance, φ such that x ∈ L if and only if φ is satisfiable. Thus, 3SAT is at least as hard as any other problem in NP. Karp further showed t...
متن کاملUsing the PCP in proving Fixed parameter inapproximability
A problem P is (r, t)-FPT-inapproximable if the problem admits no r(k) approximation that runs in time t(k) · n for a constant c. We deal with hardness of approximation of setcover and clique. A feature of our scheme is that we only use k = opt(I) for some instance I, and so the hardness in k directly implies (r(opt(I)), t(opt(I)))hardness. The way Fixed Parameter hardness was proved. before ou...
متن کامل5.2 Application to Nonapproximability of Optimization Functions
{ 26 { makes expander codes inappropriate for on-line communications, but they may be useful for storage on write-once media, because of their eecient decoding algorithms. Both of these recent developments were inspired by the innuential role that codes play in the theory of probabilistically checkable proof systems. In a forthcoming paper, Arora 2] explores this role in depth. His work formali...
متن کاملHardness of approximation of the Balanced Complete Bipartite Subgraph problem
We prove that the Maximum Balanced Complete Bipartite Subgraph (BCBS) problem is hard to approximate within a factor of 2 n) δ for some δ > 0 under the plausible assumption that 3-SAT ∈ DTIME ( 2 3/4+ ) for some > 0. We also show that it is NP -hard to approximate the BCBS problem within a constant factor under the assumption that it is NP -hard to approximate the maximum clique problem within ...
متن کاملImproved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring
In this paper, we present improved inapproximability results for three problems : the problem of finding the maximum clique size in a graph, the problem of finding the chromatic number of a graph, and the problem of coloring a graph with a small chromatic number with a small number of colors. Håstad’s celebrated result [13] shows that the maximum clique size in a graph with n vertices is inappr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005